Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое depth-first search - определение
SEARCH ALGORITHM
Depth first search; Depth-first; DFS algorithm; Depth-first traversal; Depth-First Search; Back edge; Forward edge; Depth First Search; Applications of depth-first search
Найдено результатов: 8467
depth-first search
<algorithm> A graph search algorithm which extends the
current path as far as possible before backtracking to the
last choice point and trying the next alternative path.
Depth-first search may fail to find a solution if it enters a
cycle in the graph. This can be avoided if we never extend a
path to a node which it already contains.
Opposite of breadth first search. See also {iterative
deepening}.
(1995-04-19)
Depth-first search
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
breadth-first search
![BFS on [[Maze-solving algorithm]]](https://commons.wikimedia.org/wiki/Special:FilePath/BFS-Algorithm Search Way.gif?width=200 "BFS on [[Maze-solving algorithm]]")
![Top part of [[Tic-tac-toe]] game tree](https://commons.wikimedia.org/wiki/Special:FilePath/Tic-tac-toe-game-tree.svg?width=200 "Top part of [[Tic-tac-toe]] game tree")
ALGORITHM FOR SEARCHING THE NODES OF A GRAPH IN ORDER BY THEIR HOP COUNT FROM A STARTING NODE
Breadth first search; Breadth first recursion; Breadth-first traversal; BFS algorithm; Breadth-first; Breath first search; Breath-first search; Breadth-First Search; Applications of breadth-first search
<algorithm> A graph search algorithm which tries all
one-step extensions of current paths before trying larger
extensions. This requires all current paths to be kept in
memory simultaneously, or at least their end points.
Opposite of depth-first search. See also {best first
search}.
(1996-01-05)
iterative deepening
Depth-limited search; ITDFS; Iterative deepening; IDDFS; DFSID; Depth-first search with iterative deepening; Iterative deepening search
<algorithm> A graph search algorithm that will find the
shortest path with some given property, even when the graph
contains cycles. When searching for a path through a graph,
starting at a given initial node, where the path (or its end
node) has some desired property, a depth-first search may
never find a solution if it enters a cycle in the graph.
Rather than avoiding cycles (i.e. never extend a path with a
node it already contains), iterative deepening explores all
paths up to length (or "depth") N, starting from N=0 and
increasing N until a solution is found.
(2004-01-26)
Teufe
DEPTH OF A BOREHOLE OR MINE SHAFT RELATED TO THE SURFACE
Depth (mining)
Teufe is the German mining term for depth. The Teufe (hT) indicates how deep a given point lies below the surface of an open-cast pit or below the ground level in the area surrounding the pit. By contrast, the height, h, refers to its distance from a reference surface 'above'. The vertical distance between the surface and a point in the mine (Grubengebäude), i.e. the vertical depth, was formerly also called the Seigerteufe. This difference is no longer made today. The terms Teufe and Seigerteufe are synonymous.
Carbonate compensation depth
![50px]] Modified text was copied from this source, which is available under a [https://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International License].</ref>](https://commons.wikimedia.org/wiki/Special:FilePath/Calcareous sediment in the ocean.png?width=200 "50px]] Modified text was copied from this source, which is available under a [https://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International License].</ref>")
![50px]] Modified material was copied from this source, which is available under a [https://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International License].</ref>}}](https://commons.wikimedia.org/wiki/Special:FilePath/Carbonate compensation concept.png?width=200 "50px]] Modified material was copied from this source, which is available under a [https://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International License].</ref>}}")
DEPTH IN THE OCEANS BELOW WHICH NO SEDIMENT PARTICLES ARE PRESERVED THAN CONSIST OF CALCIUM CARBONATE
Carbonate Compensation Depth; Calcite compensation depth; Aragonite compensation depth
Carbonate compensation depth (CCD) is the depth in the oceans below which the rate of supply of calcite (calcium carbonate) lags behind the rate of solvation, such that no calcite is preserved. Shells of animals therefore dissolve and carbonate particles may not accumulate in the sediments on the sea floor below this depth.
Best-first search
ALGORITHM
Best first search; Greedy best-first search; Pure heuristic search
Best-first search is a class of search algorithms, which explore a graph by expanding the most promising node chosen according to a specified rule.
best first search
ALGORITHM
Best first search; Greedy best-first search; Pure heuristic search
<algorithm> A graph search algorithm which optimises
breadth first search by ordering all current paths according
to some heuristic. The heuristic attempts to predict how
close the end of a path is to a solution. Paths which are
judged to be closer to a solution are extended first.
See also beam search, hill climbing.
(1995-12-09)
Parallel breadth-first search
User:Kit unodc/sandbox; Draft:Serial Breadth-First-Search; Draft:Parallel Breadth-First-Search; Parallel Breadth-First-Search
The breadth-first-search algorithm is a way to explore the vertexes of a graph layer by layer. It is a basic algorithm in graph theory which can be used as a part of other graph algorithms.
Search analytics
User:CrizCraig/Search Analytics; Search Analytics; Search engine history; Search engine analytics
Search analytics is the use of search data to investigate particular interactions among Web searchers, the search engine, or the content during searching episodes.Jansen, B.
Википедия
Depth-first search
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.
A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.
